Sufficient conditions for maximally connected dense graphsSONEOKA, T; NAKADA, H; IMASE, M et al.Discrete mathematics. 1987, Vol 63, Num 1, pp 53-66, issn 0012-365XArticle

The average connectivity of a graphBEINEKE, Lowell W; OELLERMANN, Ortrud R; PIPPERT, Raymond E et al.Discrete mathematics. 2002, Vol 252, Num 1-3, pp 31-45, issn 0012-365XArticle

On the connectivity function of a matroidSEYMOUR, P. D.Journal of combinatorial theory. Series B. 1988, Vol 45, Num 1, pp 25-30, issn 0095-8956Article

Path-connectivity in graphsHAGER, M.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 53-59, issn 0012-365XArticle

Connections in acyclic hypergraphsMAIER, D; ULLMAN, J. D.Theoretical computer science. 1984, Vol 32, Num 1-2, pp 185-199, issn 0304-3975Article

Super line-connectivity properties of circulant graphsBOESCH, F. T; WANG, J. F.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 1, pp 89-98, issn 0196-5212Article

Some recurrence formulas for probability of connectedness of random graphsKORDECKI, W.Teoriâ verojatnostej i eë primeneniâ. 1985, Vol 30, Num 3, pp 593-595, issn 0040-361XArticle

Propriétés complètes par commutation des graphesCHERNYAK, A. A.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1985, Num 1, pp 29-35, issn 0002-3574Article

Kritisch n-fach kantenzusammenhängende Graphen = Graphes n-arêtes-connexes critiques = Critically n-edge-connected graphsMADER, W.Journal of combinatorial theory. Series B. 1986, Vol 40, Num 2, pp 152-158, issn 0095-8956Article

A systolic design for connectivity problemsSAVAGE, C.IEEE transactions on computers. 1984, Vol 33, Num 1, pp 99-104, issn 0018-9340Article

A topology for computer networks with good surviability characteristics and low transmission delays between mode computersKELLY, G. L; JIANG, P.International journal of mini & microcomputers. 1983, Vol 5, Num 1, pp 12-17, issn 0702-0481Article

On the connectivity and the conditional diameter of graphs and digraphsBALBUENA, C; CARMONA, A; FABREGA, J et al.Networks (New York, NY). 1996, Vol 28, Num 2, pp 97-105, issn 0028-3045Article

On 3-connected matroidsLEMOS, M.Discrete mathematics. 1989, Vol 73, Num 3, pp 273-283, issn 0012-365XArticle

Efficacité de calcul des estimations de fiabilité par la méthode des circuits disjoints par arêtes et des coupuresKAUSTOV, V. A; LITVAK, E. I; USHAKOV, I. A et al.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1986, Num 1, pp 70-73, issn 0002-3388Article

Connectivity of Cartesian products of graphsSPACAPAN, Simon.Applied mathematics letters. 2008, Vol 21, Num 7, pp 682-685, issn 0893-9659, 4 p.Article

Effective bounds for Nori's connectivity theoremNAGEL, J.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1998, Vol 327, Num 2, pp 189-192, issn 0764-4442Article

A new proof of the d-connectedness of d-polytopesBRONDSTED, A; MAXWELL, G.Canadian mathematical bulletin. 1989, Vol 32, Num 2, pp 252-254, issn 0008-4395, 3 p.Article

Edge-disjoint spanning trees: a connectedness theoremFARBER, M; RICHTER, B; SHANK, H et al.Journal of graph theory. 1985, Vol 9, Num 3, pp 319-324, issn 0364-9024Article

ENUMERATION OF GRAPHS MAXIMAL WITH RESPECT TO CONNECTIVITYHORAK P.1982; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 1; PP. 81-84; ABS. RUS; BIBL. 9 REF.Article

ON MATROID CONNECTIVITYOXLEY JG.1981; Q. J. MATH.; ISSN 0033-5606; GBR; DA. 1981; VOL. 32; NO 126; PP. 193-208; BIBL. 14 REF.Article

A SUFFICIENT CONDITION FOR A GRAPH TO BE HAMILTONIANKOEHLER N.1981; MONATSH. MATH.; ISSN 0026-9255; AUT; DA. 1981; VOL. 92; NO 2; PP. 105-116; BIBL. 5 REF.Article

UPPER EMBEDDABILITY AND CONNECTIVITY OF GRAPHSPAYAN C; NGUYEN HUY XUONG.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 27; NO 1; PP. 71-80; BIBL. 10 REF.Article

Page / 77